Intermodal Public Transit Routing using Linked Connections
نویسندگان
چکیده
Ever since public transit agencies have found their way to the Web, they inform travelers using route planning software made available on their website. These travelers also need to be informed about other modes of transport, for which they have to consult other websites, or for which they have to ask the transit agency’s server maintainer to implement new functionalities. In this demo, we introduce an affordable publishing method for transit data, called Linked Connections, that can be used for intermodal route planning, by allowing user agents to execute the route planning algorithm. We publish paged documents containing a stream of hops between transit stops sorted by departure time. Using these documents, clients are able to perform intermodal route planning in a reasonable time. Furthermore, such clients are fully in charge of the algorithm, and can now also route in different ways by integrating datasets of a user’s choice. When visiting our demo, conference attendees will be able to calculate intermodal routes by querying the Web of data using their phone’s browser, without expensive server infrastructure.
منابع مشابه
A Fuzzy Bi-Objective Mathematical Model for Sustainable Hazmat Transportation
Today, transportation of hazardous materials (i.e., hazmat) is a very important issue for researchers due to the risk of this transit, which should be considered for development of industries and transportation. Therefore, a model that is useful should consider the risk and damage to humanitarian and environmental issues due to transit of hazmat materials. By considering the related cost, the r...
متن کاملPublic Transit Route Planning Through Lightweight Linked Data Interfaces
While some public transit data publishers only provide a data dump – which only few reusers can afford to integrate within their applications – others provide a use case limiting origin-destination route planning api. The Linked Connections framework instead introduces a hypermedia api, over which the extendable base route planning algorithm “Connections Scan Algorithm” can be implemented. We c...
متن کاملPlanning for Bike Share Connectivity to Rail Transit.
Bike sharing can play a role in providing access to transit stations and then to final destinations, but early implementation of these systems in North America has been opportunistic rather than strategic. This study evaluates local intermodal plan goals using trip data and associated infrastructure such as transit stops and bike share station locations in Austin, Texas, and Chicago, Illinois. ...
متن کاملFinding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm
We present an algorithm to find optimal routes in a multi-modal public transportation network. Our model takes into account many realistic features such as walking between multi-modal stations, transfer times, traffic days, multiple objectives and finding connections between geographical locations rather than just source and destination stations. In order to provide useful routing directions, w...
متن کاملDecision support in intermodal transport: A new research agenda
This paper proposes new research themes concerning decision support in intermodal transport. Decision support models have been constructed for private stakeholders (e.g. network operators, drayage operators, terminal operators or intermodal operators) as well as for public actors such as policy makers and port authorities. Intermodal research topics include policy support, terminal network desi...
متن کامل